On Grouping in Relational Algebra
نویسنده
چکیده
The concept of grouping in relational algebra is well-known from its connection to aggregation. In this paper we generalize the grouping notion by defining a simultaneous grouping of more than one relation, and we discuss the application of operations on grouping elements other than just arithmetic aggregation. Finally we show that this grouping mechanism can be added to relational algebra without increasing its computational power.
منابع مشابه
Aplicação de um Filtro Seletivo para a Otimização de Consultas Paralelas Usando o Agrupamento Prévio
Query optimization is based on query tree corresponding to its relational algebra expression, where we try to last execute grouping operation. Analytic queries, which help decision support, use intensively grouping operation. For performance improving, previous grouping is proposed, that is, we execute grouping before join. Furthermore, use of selective filter allows better results in execution...
متن کاملAnalysing Temporal Relations – Beyond Windows, Frames and Predicates
This article proposes an approach to rely on the standard operators of relational algebra (including grouping and aggregation) for processing complex event without requiring window specifications. In this way the approach can process complex event queries of the kind encountered in applications such as emergency management in metro networks. This article presents Temporal Stream Algebra (TSA) w...
متن کاملAnalysing Temporal Relations –
This article proposes an approach to rely on the standard operators of relational algebra (including grouping and aggregation) for processing complex event without requiring window specifications. In this way the approach can process complex event queries of the kind encountered in applications such as emergency management in metro networks. This article presents Temporal Stream Algebra (TSA) w...
متن کاملClassification And Optimization of Nested Queries in Object Bases
Many declarative query languages for object-oriented (oo) databases allow nested subqueries. This paper contains a complete classiication of oo nested queries and appropriate unnesting optimization strategies based on algebraic rewriting. We adapt some known relational techniques and introduce new ones that use and are concerned with features speciic to object-oriented queries. In particular, w...
متن کاملIndex-Assisted Hierarchical Computations in Main-Memory RDBMS
We address the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Recently, data model and SQL language extensions were proposed to conveniently represent and work with hierarchies. On that basis we introduce a concep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 10 شماره
صفحات -
تاریخ انتشار 1999